Topology trivialization transition in random non-gradient autonomous ODEs on a sphere
نویسندگان
چکیده
منابع مشابه
Rational general solutions of first order non-autonomous parametrizable ODEs
In this paper we study non-autonomous algebraic ODEs F(x, y, y) = 0, where F(x, y, z) ∈ Q[x, y, z], provided a proper rational parametrization P (s, t) of the corresponding algebraic surface F(x, y, z) = 0. We show the relation between a rational general solution of the non-autonomous differential equation F(x, y, y) = 0 and a rational general solution of its associated autonomous system with r...
متن کاملCovering Relations and Non-autonomous Perturbations of ODEs
Covering relations are a topological tool for detecting periodic orbits, symbolic dynamics and chaotic behavior for autonomous ODE. We extend the method of the covering relations onto systems with a time dependent perturbation. As an example we apply the method to non-autonomous perturbations of the Rössler equations to show that for small perturbation they posses symbolic dynamics.
متن کاملSets of local non-uniqueness points for autonomous scalar ODEs
It is known that if f : R → R is continuous then ẋ = f(x) with x(0) = x0 has at least one solution on some time interval [0, T (x0)). However, when f is not Lipschitz one cannot guarantee that the solutions are unique. In this paper we show that the set of points x0 ∈ R is a countable, nowhere dense set. (In particular, we show that if f(x0) 6= 0 then the solution must be locally unique.)
متن کاملRational general solutions of first order non-autonomous parametric ODEs
In this paper we study the non-autonomous algebraic ODE F (x, y, y′) = 0 with a birational parametrization P(s, t) of the corresponding algebraic surface F (x, y, z) = 0. Using this parametrization we drive to a system of ODEs in two parameters s, t of order 1 and of degree 1. We prove the correspondence of a rational general solution of the equation F (x, y, y′) = 0 and a rational general solu...
متن کاملOn the Approximation of Stable and Unstable Fiber Bundles of (Non)Autonomous ODEs - A Contour Algorithm
We propose an algorithm for the approximation of stable and unstable fibers that applies to autonomous as well as to nonautonomous ODEs. The algorithm is based on computing the zero-contour of a specific operator; an idea that was introduced in [Hüls, 2014] for discrete time systems. We present precise error estimates for the resulting contour algorithm and demonstrate its efficiency by computi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment
سال: 2016
ISSN: 1742-5468
DOI: 10.1088/1742-5468/aa511a